Terminating Tableau Calculi for Hybrid Logics Extending K

نویسندگان

  • Thomas Bolander
  • Patrick Blackburn
چکیده

This article builds on work by Bolander and Blackburn [7] on terminating tableau systems for the minimal hybrid logic K. We provide (for the basic uni-modal hybrid language) terminating tableau systems for a number of non-transitive hybrid logics extending K, such as the logic of irreflexive frames, antisymmetric frames, and so on; these systems don’t employ loop-checks. We also provide (for hybrid tense logic enriched with the universal modality) a terminating tableau calculus for the logic of transitive frames; this system makes use of loop-checks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tableaux for Hybrid XPath with Data

We provide a sound, complete and terminating tableau procedure to check satisfiability of downward XPath= formulas enriched with nominals and satisfaction operators. The calculus is inspired by ideas introduced to ensure termination of tableau calculi for certain Hybrid Logics. We prove that even though we increased the expressive power of XPath by introducing hybrid operators, the satisfiabili...

متن کامل

Tableau Calculi for Hybrid Logics

Hybrid logics were proposed in [15] as a way of boosting the expressivity of modal logics via a novel mechanism: adding labels for states in Kripke models and viewing these labels as formulae. In addition, hybrid logics may contain quanti ers to bind the labels. Thus, hybrid logics have both Kripke semantics and a rst-order binding apparatus. We present pre xed tableau calculi for weak hybrid l...

متن کامل

Terminating tableau calculi for modal logic K with global counting operators

This paper presents the first systematic treatment of tableau calculi for modal logic K with global counting operators. Using a recently introduced tableau synthesis framework we establish two terminating tableau calculi for the logic. Whereas the first calculus is a prefix tableau calculus, the second is a refinement that internalises the semantics of the logic without using nominals. We prove...

متن کامل

Terminating Tableau Systems for Hybrid Logic with Difference and Converse

This paper contributes to the principled construction of terminating tableau systems for modal logic with nominals and difference modalities [4, 1, 8, 11]. We also consider global and converse modalities and reflexive and transitive relations. Nominals and difference enrich modal logic with equational constraints, and handling these constraints in a terminating tableau system is the main challe...

متن کامل

Tableau Calculi for the Logics of Finite k-Ary Trees

We present tableau calculi for the logics Dk (k ≥ 2) semantically characterized by the classes of Kripke models built on finite k-ary trees. Our tableau calculi use the signs T and F, some tableau rules for Intuitionistic Logic and two rules formulated in a hypertableau fashion. We prove the Soundness and Completeness Theorems for our calculi. Finally, we use them to prove the main properties o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 231  شماره 

صفحات  -

تاریخ انتشار 2009